Error linear complexity measures for multisequences
نویسندگان
چکیده
منابع مشابه
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences....
متن کاملError Linear Complexity Measures of Binary Multisequences
In complexity measures for sequences over finite fields, such as the linear complexity and the k – error linear complexity is of great relevance to cryptology, in particular, to the area of stream ciphers. There are basically two types of requirements for suitability of a keystream generated by a stream cipher. One of the requirements is the keystream sequence must pass various statistical test...
متن کاملLinear Complexity Measures of Binary Multisequences
The joint linear complexity and k error joint linear complexity of an m fold 2n periodic multisequence can be efficiently computed using Modified Games Chan algorithm and Extended Stamp Martin Algorithm respectively. In this paper we derived an algorithm for finding the joint linear complexity of periodic binary multisequence with the help of Modified Games Chan algorithm. Here we derived the m...
متن کاملThe Asymptotic Normalized Linear Complexity of Multisequences
We show that the asymptotic linear complexity of a multisequence a ∈ ( F M q )∞ that is I := lim infn→∞ La(n) n and S := lim supn→∞ La(n) n satisfies the inequalities M M + 1 ≤ S ≤ 1 and M(1− S) ≤ I ≤ 1− S M , if all M sequences have nonzero discrepancy infinitely often, and all pairs (I, S) satisfying these conditions are met by 20 multisequences a. This answers an Open Problem by Dai, Imamura...
متن کاملGeneralized Joint Linear Complexity of Linear Recurring Multisequences
The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each Nperiodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2007
ISSN: 0885-064X
DOI: 10.1016/j.jco.2006.10.005